Words over an ordered alphabet and suffix permutations
نویسندگان
چکیده
Given an ordered alphabet and a permutation, according to the lexicographic order, on the set of suffixes of a word w, we present in this article a linear time and space method to determine whether a word w′ has the same permutation on its suffixes. Using this method, we are then also able to build the class of all the words having the same permutation on their suffixes, first of all the smallest one. Finally, we note that this work can lead to a method for generating a Lyndon word randomly in linear time or for computing the set of Lyndon words of length n. Mathematics Subject Classification. 68R15.
منابع مشابه
Adjacencies in Permutations
A permutation on an alphabet $ \Sigma $, is a sequence where every element in $ \Sigma $ occurs precisely once. Given a permutation $ \pi $= ($\pi_{1} $, $ \pi_{2} $, $ \pi_{3} $,....., $ \pi_{n} $) over the alphabet $ \Sigma $ =$\{ $0, 1, . . . , n$-$1 $\}$ the elements in two consecutive positions in $ \pi $ e.g. $ \pi_{i} $ and $ \pi_{i+1} $ are said to form an \emph{adjacency} if $ \pi_{i+1...
متن کاملOn the combinatorics of suffix arrays
We prove several combinatorial properties of suffix arrays, including a characterization of suffix arrays through a bijection with a certain well-defined class of permutations. Our approach is based on the characterization of Burrows-Wheeler arrays given in [1], that we apply by reducing suffix sorting to cyclic shift sorting through the use of an additional sentinel symbol. We show that the ch...
متن کاملParikh Matrices and Words over Tertiary Ordered Alphabet
Parikh matrix is a numerical property of a word on an ordered alphabet. It is used for studying word in terms of its sub words. It was introduced by Mateescu et al. in 2000. Since then it has been being studied for various ordered alphabets. In this paper Parikh Matrices over tertiary alphabet are investigated. Algorithm is developed to display Parikh Matrices of words over tertiary alphabet. T...
متن کاملStrongly square-free strings on three letters
SON "r~>_n'pp, if it contains no Abelian squares; that is, h"t"""T,fT'" which are permutations of each other. We construct finite on an alphabet of three letters. An ordered sequence X= XIX2'" Xn of elements chosen from a fixed finite set, called string of = n over the A. The denoted by A. The ordered sequence XiXi+l ,. Xj a substring of J n. In the interests of notational convenience and witho...
متن کاملInferring Strings from Suffix Trees and Links on a Binary Alphabet
A suffix tree, which provides us with a linear space full-text index of a given string, is a fundamental data structure for string processing and information retrieval. In this paper we consider the reverse engineering problem on suffix trees: Given an unlabeled ordered rooted tree T accompanied with a node-to-node transition function f , infer a string whose suffix tree and its suffix links fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITA
دوره 36 شماره
صفحات -
تاریخ انتشار 2002